Midstream order deficit occurs with phonological encoding of order
نویسندگان
چکیده
منابع مشابه
The midstream order deficit.
The relative order of an auditory sequence can be more difficult to apprehend when it is presented repeatedly without pause (i.e., cycling) than when it is presented only once (Warren, Obusek, Farmer, & Warren, 1969). We find that this phenomenon, referred to as the midstream order deficit (MOD), can also occur with visual stimuli. The stimuli need not form separate perceptual "streams," and th...
متن کاملasymptotic property of order statistics and sample quntile
چکیده: فرض کنید که تابعی از اپسیلون یک مجموع نامتناهی از احتمالات موزون مربوط به مجموع های جزئی براساس یک دنباله از متغیرهای تصادفی مستقل و همتوزیع باشد، و همچنین فرض کنید توابعی مانند g و h وجود دارند که هرگاه امید ریاضی توان دوم x متناهی و امیدریاضی x صفر باشد، در این صورت می توان حد حاصلضرب این توابع را بصورت تابعی از امید ریاضی توان دوم x نوشت. حالت عکس نیز برقرار است. همچنین ما با استفاده...
15 صفحه اولA word-order constraint on phonological activation.
Word-order rules impose major constraints on linguistic behavior. For example, adjectives appear before nouns in English, and after nouns in French. This means that constraints on word order must be language-specific properties upheld on-line by the language system. Despite the importance of these rules, little is known about how they operate. We report an influence of word order on the activat...
متن کاملGrammatical and phonological influences on word order.
During the grammatical encoding of spoken multiword utterances, various kinds of information must be used to determine the order of words. For example, whereas in adjective-noun utterances like "red car," word order can be determined on the basis of the word's grammatical class information, in noun-noun utterances like "... by car, bus, or ...," word order cannot be determined on the basis of a...
متن کاملCompact Propositional Encoding of First-Order Theories
In this paper we present polynomial-time algorithms that translate First-Order Logic (FOL) theories to smaller propositional encodings than achievable before in polynomial time. For example, we can sometimes reduce the number of propositions to O(|P | + |C|), or O(|P | · log |P |), for |P | predicates of arity k and |C| constant symbols. The guarantee depends on availability of some graphical s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2010
ISSN: 1534-7362
DOI: 10.1167/7.9.691